All Questions
Tagged with interview-questionsrecursion
24 questions
1vote
1answer
62views
Depth-first traversal implementation in Java (by recursion)
I implemented a recursive depth-first traversal, with all three traversal modes in this function. Is this the most succinct way to write the code? ...
- 325
7votes
1answer
1kviews
Recursive parser from Binary to JSON output
Background I got this interview test and got declined due to not meeting their expectations, but never got a reason on what was bad and how they solved it. I want to improve and learn something out ...
- 173
1vote
1answer
121views
Find first repeating Char in String
Given a string, find the first repeating character in it. Examples: firstUnique("Vikrant") → None ...
- 405
4votes
2answers
450views
Replace array element with multiplication of neighbors in Scala
Given an array of integers, update the index with multiplication of previous and next integers, Input: 2 , 3, 4, 5, 6 Output: 2*3, 2*4, 3*5, 4*6, 5*6 Following ...
- 405
1vote
1answer
99views
Check if list contains a pair which adds up to a given sum
Kindly review this scala code for given problem and suggest improvements. Problem - Given an array of integers and a target sum, check if array contains a pair which adds up to sum. Example - <...
- 405
3votes
2answers
150views
Simple recursive transformation solution in Python
This simple Python code I wrote for a problem asked during an interview. The problem statement is: Given a tuple (a, b), transform this into (c, d) by applying any of the two below operations ...
1vote
1answer
329views
Rearrange an array in place such that the first and last halves are interleaved
Given an array of n elements in the following format { a1, a2, a3, a4, ….., an/2, b1, b2, b3, b4, …., bn/2 }. The task is shuffle the array to {a1, b1, a2, b2, a3, b3, ……, an/2, bn/2 } without ...
1vote
2answers
766views
Find all root to leaf paths in binary tree
Description: Given a binary tree, return all root-to-leaf paths. Leetcode ...
- 5,137
2votes
1answer
522views
Find minimum depth in a binary tree
Description: Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. Note: A leaf is a node ...
- 5,137
3votes
0answers
2kviews
Robot on a Grid: Find a path between two corners with forbidden cells on the road
Problem statement The problem is defined in the book as following: 8.2 Robot in a Grid Imagine a robot sitting on the upper left corner of grid with r rows and <...
- 3,520
0votes
2answers
958views
Number of Paths (BackTracking) in Java
Illustration You're testing a new driverless car that is located at the Southwest (bottom-left) corner of an n×n grid. The car is supposed to get to the opposite, Northeast (top-right), corner ...
2votes
2answers
6kviews
Find the minimum number of coin change
Description: You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that ...
- 5,137
10votes
2answers
3kviews
xml is XML is xml is XML
I had to write some code for an interview, to print out the name attribute of each node. I started off going in the wrong direction, so I didn't get to finish. I wanted to finish writing the code, so ...
- 28.8k
2votes
1answer
2kviews
Regular Expression Matching: Recursive and DP-based implementation
Problem Statement: Implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching ...
3votes
4answers
12kviews
Multiplying 2 numbers without using * operator in Java
I saw this interview question and decided to solve using recursion in Java. Write a multiply function that multiples 2 integers without using * ...
user127004
